Student Details







1. Which of the following is a basic logic gate?




2. What is the output of a NOT gate if the input is 1?




3. The symbol below represents which gate?
AND gate symbol




4. Which logic gate outputs 1 only if both inputs are 1?




5. What is the output of an OR gate for inputs A = 1 and B = 0?




6. Which logic gate is also called an inverter?




7. Which of the following is the correct truth table for an AND gate?




8. The Boolean expression for a 2-input OR gate is:




9. If the output of a NOT gate is 1, what was the input?




10. Which of the following gates has only **one input**?




11. Which of the following is a universal gate?




12. Which logic gate produces output 0 only when all inputs are 1?




13. Which gate gives output 1 only when inputs are different?




14. The Boolean expression for a NAND gate is:




15. Which logic gate gives output 1 only when both inputs are 0?




16. What is the output of an XOR gate with inputs A = 1, B = 1?




17. Which gate has the Boolean expression: ¬(A + B)?




18. Which logic gate gives output 1 only when both inputs are the same?




19. The symbol ⊕ stands for:




20. Which of the following statements is TRUE?




In this section you will encounter things that are not familiar to you. But it's OK. Do it any way

21. The identity A + 0 = A is an example of:




22. What is the result of A + A?




23. Which of the following represents the complement law?




24. Dual of the Boolean expression A + 1 = 1 is:




25. According to De Morgan’s first theorem:
\( (A \cdot B)' = \)




26. The expression (A + B)' equals:




27. Which operation is distributive over AND in Boolean algebra?




28. Which of the following simplifies to A?




29. The consensus theorem is:




30. Duality theorem states:




31. What is the dual of A · 1 = A?




32. Which law is used to simplify A + AB = A?




33. Which of the following identities is correct?




34. In Boolean algebra, the expression A · (B + C) is equal to:




35. The circuit with one AND gate and one NOT gate connected to its output is equivalent to:




36. The simplified form of A + AB′ is:




37. What is the result of simplifying A + A′B?




38. The dual of A · B + A′ · B = B is:




39. The operation in Boolean algebra which is **commutative**, **associative**, and **distributive** is:




40. Which law is used in: A · A + A · B = A?




41. A Boolean expression in SOP form is a sum of:




42. The expression A·B + A′·C is in:




43. Which of the following is a minterm?




44. A maxterm is defined as:




45. The number of minterms in 3 variables is:




46. Minterm m5 for 3 variables A, B, C corresponds to:




47. Canonical SOP expression includes:




48. SOP expression for a truth table where output is 1 at minterms 1, 3, 5 is:




49. Product of sums (POS) form is:




50. Canonical POS includes:




51. Maxterm M2 for 3 variables A, B, C is:




52. SOP is generally preferred for:




53. POS is suitable for implementation using:




54. The total number of possible minterms for n variables is:




55. The SOP form is derived from:




56. POS form is derived from:




57. Which expression is the canonical SOP of A + B?




58. Which of the following is NOT a valid minterm for 2 variables?




59. Minterms are associated with:




60. Maxterms are associated with:




61. What defines a standard SOP expression?




62. Which is a valid standard SOP term for three variables A, B, C?




63. Standard POS expression consists of:




64. Which of the following is a standard POS term in variables A, B?




65. Which expression is a **non-standard** SOP?




66. How many variables are in standard SOP term A′·B·C?




67. Which operation is used to convert standard SOP to standard POS?




68. The expression A + B′ can be converted to standard POS by:




69. What is the standard POS form of A + B?




70. In standard SOP, the term A′B′C represents:




71. In standard POS, the term (A + B + C′) represents:




72. Which of the following is TRUE about standard SOP and POS forms?




73. Which expression corresponds to Σm(1,2,5)?




74. Which form is easier to convert into a circuit using only AND and OR gates?




75. A standard POS expression must have:




76. Which conversion requires applying De Morgan’s laws twice?




77. Which is the **standard POS** of the expression A + B?




78. What is the minterm equivalent of A′·B·C?




79. Conversion between SOP and POS affects:




80. Which symbol indicates canonical POS form?




81. What is a Karnaugh Map used for?




82. How many cells are there in a 3-variable K-map?




83. What is the number of cells in a 4-variable K-map?




84. Which of the following is not a valid group in a K-map?




85. The number of variables represented by a 2×4 K-map is:




86. What is the Gray code sequence for 2 bits?




87. In K-map grouping, adjacent cells differ by:




88. What is the simplified form of a group of 4 ones in a 2-variable K-map?




89. What is the largest group possible in a 3-variable K-map?




90. A group of 2 adjacent cells eliminates how many variables?




91. A group of 4 adjacent cells eliminates:




92. Which of the following gives the most simplified result?




93. Overlapping groups in a K-map:




94. The expression for minterms m1, m2, m3 in K-map SOP is:




95. How many 1s must be grouped in a K-map?




96. What is the simplified form of a group of 8 adjacent 1s in a 3-variable K-map?




97. How many variables are eliminated in a group of 8 cells?




98. What is the value of angular displacement for 1 revolution?




99. A 4-variable K-map groups 8 adjacent 1s. What is the simplified result?




100. Wrapping around edges in a K-map is:




These are a bit tough with a weightage of 5

101. Analyze the following circuit and determine the output expression:

        A ----┐
              AND ----┐
        B ----┘       |
                      OR ---- Y
        C ------------┘



102. What is the minimal SOP expression for the function with minterms m(1,3,7) in 3 variables?




103. Given the following 3-variable K-map, what is the simplified expression?

      AB\C | 0 | 1
      -------------
       00  | 1 | 1
       01  | 1 | 0
       11  | 0 | 1
       10  | 1 | 0



104. The Boolean equation Y = (A + B)(A′ + C) simplifies to:




105. Examine the circuit below. What is the output?

        A ----┐
              NAND ----┐
        B ----┘        |
                       AND ---- Y
        C -------------┘



106. Simplify the expression: (A + B)(A + B′)




107. Identify the correct expression for the circuit below:

         A -----┐
               OR -----┐
         B′----┘       |
                       AND ---- Y
         C′------------┘



108. From the truth table, which expression represents the output Y?

      A B C | Y
      -------------
      0 0 0 | 0
      0 0 1 | 1
      0 1 0 | 0
      0 1 1 | 1
      1 0 0 | 0
      1 0 1 | 1
      1 1 0 | 0
      1 1 1 | 1



109. What is the POS form of the function F = Σm(1, 3, 5, 7) for 3 variables?




110. Which expression correctly represents the logic in this circuit?

        A ----┐
              NOR ----┐
        B ----┘       |
                      AND ---- Y
        C′------------┘



111. What is the simplified expression for F = A·(B + A′)?




112. What will be the output Y of the circuit?

        A ----┐
              XOR ----┐
        B ----┘       |
                      AND ---- Y
        C ------------┘



113. Determine the number of prime implicants in the following K-map:

       AB\CD | 00 | 01 | 11 | 10
      --------------------------
        00   |  1 |  1 |  0 |  0
        01   |  0 |  1 |  1 |  0
        11   |  1 |  0 |  1 |  1
        10   |  0 |  0 |  1 |  1



114. Which logic gate has the output logic high only when the number of inputs high is odd?




115. Simplify the Boolean expression: A·B + A·B′




116. What is the simplified result of applying De Morgan’s Theorem to: (A + B)′?




117. Analyze the logic of the following circuit and choose the correct output expression:

         A ----┐
               AND ----┐
        B′ ----┘       |
                       NAND ---- Y
        C -------------┘



118. For the function F(A, B, C) = ΠM(0, 1, 3, 5), what is the equivalent SOP expression?




119. Examine the circuit and determine the output expression Y:

        A ----┐
              OR ----┐
        B ----┘       |
                      XNOR ---- Y
        C ------------┘



120. Which is the correct minimal POS form of the function F = 0 at minterms 0, 1, 2 in 2 variables?




121. What is the result of the logic operation: ((A + B)′ + C)′ ?




122. Which of the following circuits implements the function F = A·B + A·C?

        A ----┬---- AND ----┐
              |            |
        B ----┘            OR ---- F
                           |
        C ---- AND --------┘
              |
        A ----┘



123. From the truth table below, what is the minimal SOP expression?

     A B C | F
    ---------------
     0 0 1 | 1
     0 1 1 | 1
     1 0 0 | 1
     1 1 0 | 1



124. Which expression is equivalent to the function: F = (A·B′)′?




125. How many essential prime implicants are present in the following K-map?

       AB\CD | 00 | 01 | 11 | 10
      --------------------------
         00  |  1 |  1 |  0 |  1
         01  |  1 |  0 |  1 |  1
         11  |  0 |  1 |  1 |  0
         10  |  1 |  1 |  0 |  0



After completing the Quiz press Submit and Email

Please download the csv file and send to the email: josemathew@thecochincollege.edu.in